Multi-sorted version of second order arithmetic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subsystems of Second Order Arithmetic Second Edition

Foundations of mathematics is the study of the most basic concepts and logical structure of mathematics, with an eye to the unity of human knowledge. Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are examined to prove particular theorems in core...

متن کامل

CZF and Second Order Arithmetic

Constructive ZF + full Separation is shown to be equiconsistent with Second Order Arithmetic.

متن کامل

From Bounded Arithmetic to Second Order Arithmetic via Automorphisms

In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as PA, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following characterization of PA by proving a “reversal” of a theorem of Gaifman: Theorem. The following are equivale...

متن کامل

Second Order Arithmetic Means in Operator Ideals

We settle in the negative the question arising from [3] on whether equality of the second order arithmetic means of two principal ideals implies equality of their first order arithmetic means (second order equality cancellation) and we provide fairly broad sufficient conditions on one of the principal ideals for this implication to always hold true. We present also sufficient conditions for sec...

متن کامل

Syntactical Truth Predicates For Second Order Arithmetic

We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA. An s.t.p. is a set T of closed formulas such that: i) T (t = u) iff the closed first order terms t and u are convertible, i.e. have the same value in the standard interpretation ii) T (A → B) iff (T (A) ⇒ T (B)) iii) T (∀xA) iff (T (A[x ← t]) for any closed first order term t) iv) T (∀XA) iff (T (A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Australasian Journal of Logic

سال: 2016

ISSN: 1448-5052

DOI: 10.26686/ajl.v13i5.3936